Browsing by Subject "Distributed averaging"

Now showing items 1-4 of 4

    • Conference Object  

      Distributed balancing of a digraph with integer weights 

      Rikos, A. I.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2013)
      We address the integer weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology ...
    • Conference Object  

      Distributed minimum-time weight balancing over digraphs 

      Charalambous, T.; Hadjicostis, Christoforos N.; Johansson, M. (IEEE Computer Society, 2014)
      We address the weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). ...
    • Conference Object  

      Distributed strategies for balancing a weighted digraph 

      Hadjicostis, Christoforos N.; Rikos, A. (2012)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
    • Article  

      Distributed weight balancing over digraphs 

      Rikos, A. I.; Charalambous, T.; Hadjicostis, Christoforos N. (2014)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...